A Constructor-Based Reachability Logic for Rewrite Theories

A Constructor-Based Reachability Logic for Rewrite Theories

Reachability logic has been applied to K rewrite-rule-based language definitions as a language-generic logic of programs. To be able to verify not just code but also distributed system designs, a new rewritetheory-generic reachability logic is presented and proved sound for a wide class of rewrite theories. The logic’s automation is increased by means of constructor-based semantic unification, ...

Constructor-based observational logic

This paper focuses on the integration of reachability and observability concepts within an algebraic, institution-based framework. In the first part of this work, we develop the essential ingredients that are needed to define the constructorbased observational logic institution, called COL, which takes into account both the generationand observation-oriented aspects of software systems. The und...

Logic Programming with Constructor-based Type Constraints

A concept of types and type sorts for logic programming is introduced, where types and type sorts are regarded as constraints. Instead of deening \well-sorted" terms and substitutions, type constraints and type sort constraints are deened. The approach is based on term models. A type is interpreted as a set of object terms and a type sort is interpreted as a set of types. Parameters of types ca...

Observational logic, constructor-based logic, and their duality

Observability and reachability are important concepts for formal software development. While observability concepts are used to specify the required observable behavior of a program or system, reachability concepts are used to describe the underlying data in terms of datatype constructors. In this paper we first reconsider the observational logic institution which provides a logical framework f...

Relating Meseguer’s Rewriting Logic with the Constructor-Based Rewriting Logic